Tropical linear programming and parametric mean payoff games
نویسندگان
چکیده
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, the tropical analogues of classical linear programming results need to be developed. This motivation leads us to study a general tropical linear programming problem. We construct an associated parametric mean payoff game problem, and show that the optimality of a given point, or the unboundedness of the problem, can be certified by exhibiting a strategy for one of the players having certain infinitesimal properties (involving the value of the game and its derivative) that we characterize combinatorialy. In other words, strategies play in tropical linear programming the role of Lagrange multipliers in classical linear programming. We use this idea to design a Newtonlike algorithm to solve tropical linear programming problems, by reduction to a sequence of auxiliary mean payoff game problems.
منابع مشابه
Mean-payoff Games and Parametric Tropical Two-sided Systems
We propose a general theory of parametric two-sided tropical linear systems based on the connections with zero-sum deterministic mean-payoff games. It is shown how this general theory specializes to particular tropical linear systems with parameter, arising from 1) the two-sided tropical eigenproblem Ax = λ+Bx and 2) the tropical linear programming. This involves 1) the problem of finding the s...
متن کاملTropical linear-fractional programming and parametric mean payoff games
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to study the tropical analogue of the classical linear-fractional programming problem. We construct an associated parametric mean payoff game problem, and show that...
متن کاملCombinatorial Simplex Algorithms Can Solve Mean Payoff Games
A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff games. Moreover, any combinatorial simplex algorithm with a strongly polynomial complexity (the existence of such an algorithm is open) would provide in this way ...
متن کاملCondition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming
Semidefinite programming can be considered over any real closed field, including fields of Puiseux series equipped with their nonarchimedean valuation. Nonarchimedean semidefinite programs encode parametric families of classical semidefinite programs, for sufficiently large values of the parameter. Recently, a correspondence has been established between nonarchimedean semidefinite programs and ...
متن کاملThe Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average
We introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a tropical analogue of the shadowvertex simplex algorithm, which solves mean payoff games via linear feasibility problems over the tropical semiring (R ∪ {−∞},max,+)...
متن کامل